منابع مشابه
Compatible geometric matchings
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings M and M ′ of the same set of n points, for some k ∈ O(log n), there is a sequence of perfect matchings M = M0,M1, . . . ,Mk = M , such that each Mi is compatible wi...
متن کاملMatchings in Geometric Graphs
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study matching problems in...
متن کاملTRACTATUS on disjoint matchings in cubic graphs
In early 70s Berge conjectured that any bridgeless cubic graph contains five perfect matchings such that each edge belongs to at least one of them. In 1972 Fulkerson conjectured that, in fact, we can find six perfect matchings containing each edge exactly twice. By introducing the concept of an r-graph (a remarkable generalization of one of bridgeless cubic graph) Seymour in 1979 conjectured th...
متن کاملOn edge-disjoint pairs of matchings
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for |M |/|H |.
متن کاملNeighborhood conditions and edge-disjoint perfect matchings
Faudree, R.J., R.J. Gould and L.M. Lesniak, Neighborhood conditions and edge-disjoint perfect matchings, Discrete Mathematics 91 (1991) 33-43. A graph G satisfies the neighborhood condition ANC(G) 2 m if, for all pairs of vertices of G, the union of their neighborhoods has at least m vertices. For a fixed positive integer k, let G be a graph of even order n which satisfies the following conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2012
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-012-9466-9